Multifractal decomposition on certain random recursive sets 一类随机递归集的重分形分解
The multifractal decomposition of a class of generalized multi - type random recursive sets on statistically self - similar measures 一类多型随机递归集关于统计自相似测度的重分形分解
In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set.